Coherent branching feature bisimulation
نویسندگان
چکیده
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers.
منابع مشابه
Co-induction Characterization of Branching Bisimulation with Explicit Divergence∗
Branching bisimulation with explicit divergence, introduced by van Glabbeek and Weijland, is an important relation between processes. It is the weakest equivalence relation which is a branching bisimulation and at the same time divergence preserving. Like branching bisimulation, it has two major characterizations in the literature: a relational characterization and a coloured trace characteriza...
متن کاملBack and forth bisimulations
This paper is concerned with bisimulation relations which do not only require related agents to simulate each others behavior in the direction of the arrows, but also to simulate each other when going back in history. First it is demonstrated that the back and forth variant of strong bisimulation leads to the same equivalence as the ordinary notion of strong bisimulation. Then it is shown that ...
متن کاملBranching Bisimulation with Explicit Divergence
We consider the relational characterisation of branching bisimulation with explicit divergence. We prove that it is an equivalence relation and that it coincides with the original definition of branching bisimulation with explicit divergence in terms of coloured traces. We also establish a correspondence with several variants of an action-based modal logic with untiland divergence modalities.
متن کاملA Complete Axiomatization for Pre x Iteration in Branching Bisimulation
This paper studies the interaction of pre x iteration x with the silent step in the setting of branching bisimulation That is we present a nite equational axiomatization for Basic Process Algebra with deadlock empty process and the silent step extended with pre x iteration and prove that this axiomatization is complete with respect to rooted branching bisimulation equivalence
متن کاملAn Axiomatization for Regular Processes in Times Branching Bisimulation
Klusener introduced a timed variant of branching bisimulation. In this paper it is shown that Klusener's axioms for nite process terms, together with two standard axioms for recursion, make a complete axiomatization for regular processes modulo timed branching bisimulation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015